Fraction Free Gaussian Elimination for Sparse Matrices
نویسندگان
چکیده
منابع مشابه
Sparse Gaussian Elimination Andorthogonal
We consider the solution of a linear system Ax = b on a distributed memory machine when the matrix A has full rank and is large, sparse and nonsymmetric. We use our Cartesian nested dissection algorithm to compute a ll-reducingcolumn ordering of the matrix. We develop algorithms that use the associated separator tree to estimate the structure of the factor and to distribute and perform numeric ...
متن کاملParametric Markov Chains: PCTL Complexity and Fraction-free Gaussian Elimination
Parametric Markov chains have been introduced as a model for families of stochastic systems that rely on the same graph structure, but differ in the concrete transition probabilities. The latter are specified by polynomial constraints for the parameters. Among the tasks typically addressed in the analysis of parametric Markov chains are (1) the computation of closed-form solutions for reachabil...
متن کاملA Generalized Sylvester Identity and Fraction-free Random Gaussian Elimination
Sylvester's identity is a well-known identity which can be used to prove that certain Gaussian elimination algorithms are fraction-free. In this paper we will generalize Sylvester's identity and use it to prove that certain random Gaussian elimination algorithms are fraction-free. This can be used to yield fraction-free algorithms for solving Ax = b (x 0) and for the simplex method in linear pr...
متن کاملReordering sparse matrices for parallel elimination
We consider the problem of finding equivalent reorderings of a sparse matrix so that the reordered matrix is suitable for parallel Ganssian elimination. The elimination tree structure is used as our parallel model. We show that the reordering scheme by Jess and Kees generates an elimination tree with minimum height among all such trees from the class of equivalent reorderings. A new height-redu...
متن کاملA Novel Parallel Algorithm for Gaussian Elimination of Sparse Unsymmetric Matrices
We describe a new algorithm for Gaussian Elimination suitable for general (unsymmetric and possibly singular) sparse matrices of any entry type, which has a natural parallel and distributed-memory formulation but degrades gracefully to sequential execution. We present a sample MPI implementation of a program computing the rank of a sparse integer matrix using the proposed algorithm. Some prelim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1995
ISSN: 0747-7171
DOI: 10.1006/jsco.1995.1022